#include<bits/stdc++.h>
using namespace std;
const int MINF = 1e5+5;
int n,r[MINF],ans;
bool vis[MINF],f;

int main(void) {
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    scanf("%d",&n);
    for(int i=1;i<=n;i++) {scanf("%d",&r[i]);}
    sort(r+1,r+1+n);
    for(int i=1;i<n;i++) {
        for(int j=i+1;j<=n;j++) {
            if(vis[j] || r[j] == r[i]) continue;
            ans++;
            vis[j]=true;
            break;
        }
    }
    ans=n-ans;
    printf("%d\n",ans);
    return 0;
}
